Abstracting Refinements for Transformation
نویسندگان
چکیده
ING REFINEMENTS FOR TRANSFORMATION EINAR BROCH JOHNSEN University of Oslo, Department of Informatics P.O. Box 1080 Blindern, N-0316 Oslo, Norway [email protected] CHRISTOPH LÜTH Universität Bremen, FB 3 — Mathematik und Informatik P.O. Box 330 440, D-28334 Bremen, Germany [email protected] Abstract. Formal program development by stepwise refinement involves a lot of work discharging proof obligations. Transformational techniques can reduce this work: applying correct transformation rules removes the need for verifying the correctness of each refinement step individually. However, a crucial problem is how to identify appropriate transformation rules. In this paper, a method is proposed to incrementally construct a set of correctness preserving transformation rules for refinement relations in arbitrary specification formalisms. Transformational developments are considered as proofs, which are generalised. This results in a framework where specific example refinements can be systematically generalised to more applicable transformation rules. The method is implemented in the Isabelle theorem prover and demonstrated on an example of data refinement. Formal program development by stepwise refinement involves a lot of work discharging proof obligations. Transformational techniques can reduce this work: applying correct transformation rules removes the need for verifying the correctness of each refinement step individually. However, a crucial problem is how to identify appropriate transformation rules. In this paper, a method is proposed to incrementally construct a set of correctness preserving transformation rules for refinement relations in arbitrary specification formalisms. Transformational developments are considered as proofs, which are generalised. This results in a framework where specific example refinements can be systematically generalised to more applicable transformation rules. The method is implemented in the Isabelle theorem prover and demonstrated on an example of data refinement. ACM CCS
منابع مشابه
A Tool for Functional Verification of System Level Model Refinements
Increase in system level modeling has given rise to a need for efficient functional validation of models above cycle accurate level. This paper presents a tool for comparing system level models, before and after a refinement. Verifiable refinements include mapping functionality in the specification to platform components, static scheduling of functions mapped to a component and routing of trans...
متن کاملOn Repairing Reasoning Reversals via Representational Refinements
Representation is a fluent. A mismatch between the real world and an agent’s representation of it can be signalled by unexpected failures (or successes) of the agent’s reasoning. The ‘real world’ may include the ontologies of other agents. Such mismatches can be repaired by refining or abstracting an agent’s ontology. These refinements or abstractions may not be limited to changes of belief, bu...
متن کاملInterpretation and Transformation for Abstracting Conversations
We address the challenge of automatically abstracting conversations such as face-to-face meetings and emails. We focus here on the stages of interpretation, where sentences are mapped to a conversation ontology, and transformation, where the summary content is selected. Our approach is fully developed and tested on meeting speech, and we subsequently explore its application to email conversations.
متن کاملPreliminary Insights on Temporal Approximation
In this paper we present some preliminary formulations of temporal approximations and refinements. These are respectively the processes of abstracting away details about temporal objects, and the processes of adding more detail to them. Intelligent robots operating in the world will not only need to reason temporally, but they will need to be able to approximate or refine their reasoning as nec...
متن کاملReducing the Verbosity of Imperative Model Refinements by Using General-Purpose Language Facilities
Refinements are model transformations that leave large parts of the source models unchanged. Therefore, if refinements are executed outplace, model elements need to be copied to the target model. Refinements written in imperative languages are increasingly verbose, unless suitable language facilities exist for creating these copies implicitly. Thus, for languages restricted to general-purpose f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Nord. J. Comput.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003